A Note on the Freiman and Balog–szemerédi–gowers Theorems in Finite Fields

نویسندگان

  • BEN GREEN
  • I. E. Shparlinski
چکیده

We prove quantitative versions of the Balog–Szemerédi–Gowers and Freiman theorems in the model case of a finite field geometry F2 , improving the previously known bounds in such theorems. For instance, if A ⊆ F2 is such that |A + A|6 K |A| (thus A has small additive doubling), we show that there exists an affine subspace H of F2 of cardinality |H | K−O( √ K ) |A| such that |A ∩ H |> (2K )−1|H |. Under the assumption that A contains at least |A|3/K quadruples with a1 + a2 + a3 + a4 = 0, we obtain a similar result, albeit with the slightly weaker condition |H | K−O(K |A|. 2000 Mathematics subject classification: primary 11B99.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The (gowers-)balog-szemerédi Theorem: an Exposition

We briefly discuss here the Balog-Szemerédi theorem, compare its different versions and prove, following Gowers, the strongest one — also due to Gowers. 1. Discussion For a finite set A of elements of an abelian group and a group element s, by νA(s) we denote the number of representations of s as a sum of two elements of A: νA(s) = #{(a′, a′′) ∈ A× A : s = a′ + a′′}. We write 2A = {a′ + a′′ : a...

متن کامل

Selected Results in Additive Combinatorics: An Exposition

We give a stripped-down, self-contained exposition of selected results in additive combinatorics over the vector space F2, leading to the result by Samorodnitsky (STOC 2007) stating that linear transformations are efficiently testable. In particular, we prove the theorems known as the Balog-Szemerédi-Gowers theorem (Combinatorica 1994 and GAFA 1998) and the Freiman-Ruzsa theorem (AMS 1973 and A...

متن کامل

Selected Results in Additive Combinatorics: An Exposition (Preliminary Version)

We give a self-contained exposition of selected results in additive combinatorics over the group GF (2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Balog-Szemeredi-Gowers theorem (’94 and ’98) and the Freiman-Ruzsa theorem (’73 and ’99), leading to the remarkable result by Samorodnitsky (’07) that linear transformations are efficiently testable. No new result is pro...

متن کامل

An Introduction to Additive Combinatorics

This is a slightly expanded write-up of my three lectures at the Additive Combinatorics school. In the first lecture we introduce some of the basic material in Additive Combinatorics, and in the next two lectures we prove two of the key background results, the Freiman-Ruzsa theorem and Roth’s theorem for 3-term arithmetic progressions. Lecture I: Introductory material 1. Basic Definitions. 2. I...

متن کامل

On a Certain Generalization of the Balog-Szemerédi-Gowers Theorem

The Balog-Szemerédi-Gowers theorem has a rich history, and is a very useful tool in additive combinatorics. It began with a paper by Balog and Szemerédi [2], and then was refined by Gowers [3] to the following basic result (actually, Gowers proved somewhat more than we state here): Theorem 1 There exists an absolute constant κ > 0 such that the following holds for all finite subsets X and Y of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007